Theory of partial-order programming
نویسندگان
چکیده
منابع مشابه
Theory of Partial - Order Programming 1
This paper shows the use of partial-order program clauses and lattice domains for declarative programming. This paradigm is particularly useful for expressing concise solutions to problems from graph theory, program analysis, and database querying. These applications are characterized by a need to solve circular constraints and perform aggregate operations, a capability that is very clearly and...
متن کاملStratified Partial-Order Logic Programming
The stable semantics has become a prime candidate for knowledge representation and reasoning. The rules associated with propositional logic programs and the stable semantics are not expressive enough to let one write concise optimization programs. We propose an extension to the language of logic programs that allows one to express optimization problems in a suitable well. In earlier work we def...
متن کاملPartial Order Reduction for Rewriting Semantics of Programming Languages
Partial order reduction (POR) capabilities are typically added by extending a model checking algorithm supporting analysis of programs in a given programming language. In this paper we propose a generic method to generate a model checker with POR capabilities for any programming language of interest. The method is based on giving a formal executable specification of the semantics of a programmi...
متن کاملMathematical Programming Models for Optimizing Partial-Order Plan Flexibility
A partial-order plan (POP) compactly encodes a set of sequential plans that can be dynamically chosen by an agent at execution time. One natural measure of the quality of a POP is its flexibility, which is defined to be the total number of sequential plans it embodies (i.e., its linearizations). As this criteria is hard to optimize, existing work has instead optimized proxy functions that are c...
متن کاملConstraint Equational Logic Programming and Resource{based Partial Order Planning
Nowadays planning systems are usually based on partially order sets of actions as these sets specify necessary ordering constraints but do not commit otherwise. While computing these sets one usually maintains lists of links in order to detect potential threats. As shown in this paper these maintenance operations are unneccessary if the preconditions as well as eeects of actions are modelled as...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Science of Computer Programming
سال: 1999
ISSN: 0167-6423
DOI: 10.1016/s0167-6423(98)00018-5